A Diametric Theorem in Z nm for Lee and Related Distances

The Diametric Theorem in Hamming Spaces-Optimal Anticodes

Ž n . For a Hamming space X , d , the set of n-length words over the alphabet a H 4 n X s 0, 1, . . . , a y 1 endowed with the distance d , which for two words x s a H Ž . n Ž . n x , . . . , x , y s y , . . . , y g X counts the number of different components, 1 n 1 n a we determine the maximal cardinality of subsets with a prescribed diameter d or, in another language, anticodes with distance ...

A unique common fixed point theorem for six maps in g-metric spaces

In this paper we obtain a unique common xed point theorem for sixweakly compatible mappings in G-metric spaces.

$S$-metric and fixed point theorem

In this paper, we prove a general fixed point theorem in $textrm{S}$-metric spaces for maps satisfying an implicit relation on complete metric spaces. As applications, we get many analogues of fixed point theorems in metric spaces for $textrm{S}$-metric spaces.

The Edge-Diametric Theorem in Hamming Spaces

The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswede and Khachatrian [A diametric theorem for edges, J. Combin. Theory Ser. A 92(1) (2000) 1–16]. © 2007 Elsevier B.V. All rights reserved.

A diametric theorem for edges